package com.javabasic.algorithm.leetcode;

/**
 * @author mir.xiong
 * @version 1.0
 * @description
 * @see
 * @since Created by work on 2022/3/8 8:52 上午
 */
public class PlatesBetweenCandles {

    public int[] platesBetweenCandles(String s, int[][] queries) {
        int len = s.length();
        int[] dpPositiveSeq = new int[len];
        int[] dpInvertedSeq = new int[len];
        int preTag = -1;
        for (int i = 0; i < len; i++) {
            if (s.charAt(i) == '|') {
                preTag=i;
            }
            dpPositiveSeq[i] = preTag;
        }

        preTag = -1;
        for (int i = len-1; i >= 0; i--) {
            if (s.charAt(i) == '|') {
                preTag=i;
            }
            dpInvertedSeq[i] = preTag;
        }


        return null;
    }
}
